MacLane's planarity criterion for locally finite graphs
نویسندگان
چکیده
منابع مشابه
MacLane's planarity criterion for locally finite graphs
MacLane’s planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B. Solving a problem of Wagner (1970), we show that the topological cycle space introduced recently by Diestel and Kühn allows a verbatim generalisation of MacLane’s criterion to locally finite graphs. This then enables us to...
متن کاملA planarity criterion for cubic bipartite graphs
We prove that a simple finite bipartite cubic non-planar graph contains a clean subdivision of K3.3. Here a subdivision of K3,3 is defined 1o be clean if it can be obtained from K3,3 by subdividing any edge by an even number of vertices. The proof is constructive and gives rise to a polynomial-time algorithm. @ 1998 Elsevier Science B.V. All rights reserved
متن کاملFinite locally-quasiprimitive graphs
A 1nite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphisms if, for all vertices , the stabiliser in G of is quasiprimitive on the set of vertices adjacent to . (A permutation group is said to be quasiprimitive if all of its non-trivial normal subgroups are transitive.) The graph theoretic condition of local quasiprimitivity is strictly weaker than the condition...
متن کاملRelaxing Planarity for Topological Graphs
According to Euler’s formula, every planar graph with n vertices has at most O(n) edges. How much can we relax the condition of planarity without violating the conclusion? After surveying some classical and recent results of this kind, we prove that every graph of n vertices, which can be drawn in the plane without three pairwise crossing edges, has at most O(n) edges. For straight-line drawing...
متن کاملPlanarity and duality of finite and infinite graphs
We present a short proof of the following theorems simultaneously: Kuratowski’s theorem, Fary’s theorem, and the theorem of Tutte that every 3-connected planar graph has a convex representation. We stress the importance of Kuratowski’s theorem by showing how it implies a result of Tutte on planar representations with prescribed vertices on the same facial cycle as well as the planarity criteria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2006
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2005.07.005